Winner Determination in Geometrical Combinatorial Auctions
نویسندگان
چکیده
منابع مشابه
Approaches to winner determination in combinatorial auctions
Combinatorial auctions, i.e. auctions where bidders can bid on combinations of items, tend to lead to more eecient allocations than traditional auctions in multi-item auctions where the agents' valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP-complete. First, existing approaches for tackling this problem are reviewed: exhaustive enu-mera...
متن کاملWinner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملWinner determination in combinatorial auctions with logic-based bidding languages
We propose the use of logic-based preference representation languages based on weighted propositional formulas for specifying bids in a combinatorial auction. We then develop several heuristics for a branch-and-bound search algorithm for determining the winning bids in this framework and report on their empirical performance. The logic-based approach is attractive due to its high degree of flex...
متن کاملAlgorithm for optimal winner determination in combinatorial auctions ✩
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item auctions where the agents’ valuations of the items are not additive. However, determining the winners so as to maximize revenue is NP-complete. First, we analyze existing approaches for tackling this problem: exhau...
متن کاملAn Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions
This paper presents an approximate algorithm for the winner determination problem in combinatorial auctions, which is based on limited discrepancy search (LDS). Internet auctions have become an integral part of Electronic Commerce and can incorporate largescale, complicated types of auctions including combinatorial auctions, where multiple items are sold simultaneously and bidders can express c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2016
ISSN: 1556-5068
DOI: 10.2139/ssrn.2777489